BRCE: bi-roles co-evolution for energy-efficient distributed heterogeneous permutation flow shop scheduling with flexible machine speed
نویسندگان
چکیده
Abstract Distributed manufacturing is the mainstream model to accelerate production. However, heterogeneous production environment makes engineer hard find optimal scheduling. This work investigates energy-efficient distributed permutation flow scheduling problem with flexible machine speed (DHPFSP-FMS) minimizing makespan and energy consumption simultaneously. In DHPFSP-FMS, local search misleads population falling into optima which reduces convergence diversity. To solve this problem, a bi-roles co-evolutionary algorithm proposed contains following improvements: First, global divided two swarms producer consumer balance computation. Second, three heuristic rules are designed get high-quality initialization population. Next, five problem-based strategies converging. Then, an efficient energy-saving strategy presented save energy. Finally, verify performance of algorithm, 22 instances generated based on Taillard benchmark, number numerical experiments adopted. The experiment results state that our superior state-of-arts more for DHPFSP-FMS.
منابع مشابه
Batch Scheduling in Flexible Flow Shop
In this paper, the problem of batch scheduling in a flexible flow shop environment is studied. It is assumed that machines in some stages are able to process a number of jobs simultaneously. The applications of this problem can be found in various industries including spring and wire manufacturing and in auto industry. A mixed integer programming formulation of the problem is presented and it i...
متن کاملBatch Scheduling in Flexible Flow Shop
In this paper, the problem of batch scheduling in a flexible flow shop environment is studied. It is assumed that machines in some stages are able to process a number of jobs simultaneously. The applications of this problem can be found in various industries including spring and wire manufacturing and in auto industry. A mixed integer programming formulation of the problem is presented and it i...
متن کاملMILP Formulation and Genetic Algorithm for Non-permutation Flow Shop Scheduling Problem with Availability Constraints
In this paper, we consider a flow shop scheduling problem with availability constraints (FSSPAC) for the objective of minimizing the makespan. In such a problem, machines are not continuously available for processing jobs due to preventive maintenance activities. We proposed a mixed-integer linear programming (MILP) model for this problem which can generate non-permutation schedules. Furthermor...
متن کاملTight Bounds for Permutation Flow Shop Scheduling
In flow shop scheduling there are m machines and n jobs, such that every job has to be processed on the machines in the fixed order 1, . . . , m. In the permutation flow shop problem, it is also required that each machine processes the set of all jobs in the same order. Formally, given n jobs along with their processing times on each machine, the goal is to compute a single permutation of the j...
متن کاملEconomic Lot Sizing and Scheduling in Distributed Permutation Flow Shops
This paper addresses a new mixed integer nonlinear and linear mathematical programming economic lot sizing and scheduling problem in distributed permutation flow shop problem with number of identical factories and machines. Different products must be distributed between the factories and then assignment of products to factories and sequencing of the products assigned to each factory has to be d...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Complex & Intelligent Systems
سال: 2023
ISSN: ['2198-6053', '2199-4536']
DOI: https://doi.org/10.1007/s40747-023-00984-x